Word Processing in Coxeter Groups∗
نویسنده
چکیده
Several de nitions, facts, and theorems stated during the recent talks given by Dr. Donnelly relating to the word problem for Coxeter groups are restated in 1 to provide some background information and notation. Three other facts, due to Casselman, are also stated and proved as lemmas in this section. In 2, we state and prove Tits' Theorem for the word problem on Coxeter groups. Finally, we consider some applications and corollaries of Tits' Theorem in 3.
منابع مشابه
Conjugacy of Coxeter Elements
For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations. We prove that Cox...
متن کاملLogspace Computations in Graph Groups and Coxeter Groups
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the complexity of computing normal forms for important classes of groups. We show that shortlex normal forms in graph groups and in right-angled Coxeter groups can ...
متن کاملAutomorphisms of nearly finite Coxeter groups
Suppose that W is an infinite Coxeter group of finite rank n, and suppose that W has a finite parabolic subgroup WJ of rank n 1. Suppose also that the Coxeter diagram of W has no edges with infinite labels. Then any automorphism of W that preserves reflections lies in the subgroup of AutðWÞ generated by the inner automorphisms and the automorphisms induced by symmetries of the Coxeter graph. If...
متن کاملCentralizers of Coxeter Elements and Inner Automorphisms of Right-Angled Coxeter Groups
Let W be a right-angled Coxeter group. We characterize the centralizer of the Coxeter element of a finite special subgroup of W. As an application, we give a solution to the generalized word problem for Inn(W ) in Aut(W ). Mathematics Subject Classification: 20F10, 20F28, 20F55
متن کاملPowers of Coxeter Elements in Infinite Groups Are Reduced
Let W be an infinite irreducible Coxeter group with (s1, . . . , sn) the simple generators. We give a simple proof that the word s1s2 · · · sns1s2 · · · sn · · · s1s2 · · · sn is reduced for any number of repetitions of s1s2 · · · sn. This result was proved for simplylaced, crystallographic groups by Kleiner and Pelley using methods from the theory of quiver representations. Our proof only usin...
متن کامل